Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

+(x, 0) → x
+(x, i(x)) → 0
+(+(x, y), z) → +(x, +(y, z))
*(x, +(y, z)) → +(*(x, y), *(x, z))
*(+(x, y), z) → +(*(x, z), *(y, z))

Q is empty.


QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

+(x, 0) → x
+(x, i(x)) → 0
+(+(x, y), z) → +(x, +(y, z))
*(x, +(y, z)) → +(*(x, y), *(x, z))
*(+(x, y), z) → +(*(x, z), *(y, z))

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:
i1 > 0
*2 > +2 > 0

Status:
i1: [1]
+2: [1,2]
0: multiset
*2: multiset